# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def maxPoints(self, points: List[List[int]]) -> int:
        def qcd(p: int, q: int):
            if q == 0:
                return p
            return qcd(p, p % q)

        ans = 0
        point_count = len(points)
        if point_count <= 2:
            return point_count

        for i in range(point_count):
            point = points[i]
            line_dict = {}
            for j in range(i + 1, point_count):
                delta_x = points[j][0] - point[0]
                delta_y = points[j][1] - point[1]

                if delta_x == 0:
                    key = '1_0'
                elif delta_y == 0:
                    key = '0_1'
                else:
                    k = qcd(delta_y, delta_x)
                    key = str(delta_y / k) + "_" + str(delta_x / k)

                count = line_dict.get(key, 0)
                if count == 0:
                    line_dict[key] = 2
                    ans = max(2, ans)
                else:
                    line_dict[key] = count + 1
                    ans = max(count + 1, ans)

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([[1, 1], [2, 2], [3, 3]], 3),
        ([[1, 1], [3, 2], [5, 3], [4, 1], [2, 3], [1, 4]], 4)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.maxPoints(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

